Linear combinations of heuristics for examination timetabling
نویسندگان
چکیده
منابع مشابه
Linear combinations of heuristics for examination timetabling
Although they are simple techniques from the early days of timetabling research, graph colouring heuristics are still attracting significant research interest in the timetabling research community. These heuristics involve simple ordering strategies to first select and colour those vertices that are most likely to cause trouble if deferred until later. Most of this work used a single heuristic ...
متن کاملMonte Carlo hyper-heuristics for examination timetabling
Automating the neighbourhood selection process in an iterative approach that uses multiple heuristics is not a trivial task. Hyper-heuristics are search methodologies that not only aim to provide a general framework for solving problem instances at different difficulty levels in a given domain, but a key goal is also to extend the level of generality so that different problems from different do...
متن کاملCase-based selection of initialisation heuristics for metaheuristic examination timetabling
Examination timetabling problems are often solved by a two-phase procedure combining a sequential construction heuristic with a metaheuristic improvement search. There can be many combinations of pairing candidate construction heuristics with a metaheuristic. Different pairings are known to produce solutions of varying quality. In this paper we propose a Case Based Reasoning methodology for sel...
متن کاملEvolving hyper-heuristics for the uncapacitated examination timetabling problem
This paper presents a genetic programming (GP) hyper-heuristic approach that optimizes a search space of functions to assess the difficulty of allocating an examination during the timetable construction process. Each function is a heuristic combination of lowlevel construction heuristics combined by logical operators. The approach is tested on a set of five benchmark problems of varying difficu...
متن کاملScatter Search and Graph Heuristics for the Examination Timetabling Problem
Examination timetabling problem is an optimization problem which consists in assigning a set of exams to a set of contiguous time slot, satisfying a set of constraints. The problem falls in the category of the NP-Complete problems and is usually tackled using heuristic methods. In this paper we describe a solution algorithm and its implementation based on the graph heuristics and the evolutiona...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2011
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-011-0854-y